Teams of Global Equilibrium Search Algorithms for Solving the Weighted Maximum Cut Problem in Parallel
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولParallel Approximation Algorithms for the Weighted Maximum Matching Problem
We consider the problem of computing a matching in a large weighted graph using a parallel algorithm. Since an exact algorithm for the weighted matching problem is fairly costly we instead develop a fast approximation algorithm. The parallel algorithm is based on a distributed algorithm due to Hoepman [6]. Through experiments using both complete as well as sparse graphs we show that our new alg...
متن کاملApproximation Algorithms for the Maximum Cut Problem
Consider the problem of keeping closely related objects together and seperating unrelated objects from each other. This idea has clear applications to statistics, computer science, mathematics, social studies, and natural sciences just to name a few. To model this idea, we de ne the maximum cut problem that is simple to state but di cult to solve. The aim of this report is to provide two known ...
متن کاملFast Parallel Approximation Algorithms for Maximum Weighted Matching Problem
We present two parallel approximation algorithms for nding a matching of maximum weight in a given edge-weighted graph. To deal with unbounded weights e ciently on a PRAM, the algorithms only use the total order of the weights. That is, we assume that the algorithms can only compare with weights of edges. The rst algorithm deterministically runs in O(log n) time. Its approximation ratio is 2 3 ...
متن کاملthe search for the self in becketts theatre: waiting for godot and endgame
this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cybernetics and Systems Analysis
سال: 2015
ISSN: 1060-0396,1573-8337
DOI: 10.1007/s10559-015-9692-2